A Min-Max Theorem for k-submodular Functions and Extreme Points of the Associated Polyhedra

نویسندگان

  • Shin-ichi TANIGAWA
  • SATORU FUJISHIGE
  • SHIN-ICHI TANIGAWA
چکیده

A. Huber and V. Kolmogorov (ISCO 2012) introduced a concept of k-submodular function as a generalization of ordinary submodular (set) functions and bisubmodular functions. They presented a min-max relation for the k-submodular function minimization by considering l1 norm, which requires a non-convex set of feasible solutions associated with the k-submodular function. Our approach overcomes the trouble incurred by the non-convexity by means of a new norm composed of l1 and l∞ norms. We show another min-max relation that characterizes the minimum of a k-submodular function in terms of the maximum of the negative of the norm values over the associated convex set of feasible solutions. The min-max relation given in the present paper is simpler than that of Huber and Kolmogorov. We also show a counterexample to a characterization, given by Huber and Kolmogorov, of extreme points of the k-submodular polyhedron in their sense and make it a correct one by fixing a flaw therein.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards Minimizing k-Submodular Functions

In this paper we investigate k-submodular functions. This natural family of discrete functions includes submodular and bisubmodular functions as the special cases k = 1 and k = 2 respectively. In particular we generalize the known Min-Max-Theorem for submodular and bisubmodular functions. This theorem asserts that the minimum of the (bi)submodular function can be found by solving a maximization...

متن کامل

Convexity and Steinitz's Exchange Property

Convex analysis” is developed for functions defined on integer lattice points. We investigate the class of functions which enjoy a variant of Steinitz’s exchange property. It includes linear functions on matroids, valuations on matroids (in the sense of Dress and Wenzel), and separable concave functions on the integral base polytope of submodular systems. It is shown that a function ω has the S...

متن کامل

Title Generalized skew bisubmodularity: A characterization and a min‒max theorem

Huber, Krokhin, and Powell (2013) introduced a concept of skew bisubmodularity, as a generalization of bisubmodularity, in their complexity dichotomy theorem for valued constraint satisfaction problems over the three-value domain. In this paper we consider a natural generalization of the concept of skew bisubmodularity and show a connection between the generalized skew bisubmodularity and a con...

متن کامل

Generalized skew bisubmodularity: A characterization and a min-max theorem

Huber, Krokhin, and Powell (Proc. SODA2013) introduced a concept of skew bisubmodularity, as a generalization of bisubmodularity, in their complexity dichotomy theorem for valued constraint satisfaction problems over the three-value domain. In this paper we consider a natural generalization of the concept of skew bisubmodularity and show a connection between the generalized skew bisubmodularity...

متن کامل

Maximizing Non-monotone Submodular Functions under Matroid and Knapsack Constraints

Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hypergraphs, certain constraint satisfaction problems, maximum entropy sampling, and maximum facility location problems. Unlike submodular minimization, submodular maximization is NP-hard. In this paper, we give the firs...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013